Nonlinear FETI-DP and BDDC Methods
نویسندگان
چکیده
New nonlinear FETI-DP (dual-primal finite element tearing and interconnecting) and BDDC (balancing domain decomposition by constraints) domain decomposition methods are introduced. In all these methods, in each iteration, local nonlinear problems are solved on the subdomains. The new approaches can significantly reduce communication and show a significantly improved performance, especially for problems with localized nonlinearities, compared to a standard Newton–Krylov–FETI-DP or BDDC approach. Moreover, the coarse space of the nonlinear FETI-DP methods can be used to accelerate the Newton convergence. It is also found that the new nonlinear FETI-DP and nonlinear BDDC methods are not as closely related as in the linear context. Numerical results for the p-Laplace operator are presented.
منابع مشابه
A 738
New nonlinear FETI-DP (dual-primal finite element tearing and interconnecting) and BDDC (balancing domain decomposition by constraints) domain decomposition methods are introduced. In all these methods, in each iteration, local nonlinear problems are solved on the subdomains. The new approaches can significantly reduce communication and show a significantly improved performance, especially for ...
متن کاملOn the Equivalence of Primal and Dual Substructuring Preconditioners
After a short historical review, we present four popular substructuring methods: FETI-1, BDD, FETI-DP, BDDC, and derive the primal versions to the two FETI methods, called PFETI-1 and P-FETI-DP, as proposed by Fragakis and Papadrakakis. The formulation of the BDDC method shows that it is the same as P-FETI-DP and the same as a preconditioner introduced by Cros. We prove the equality of eigenval...
متن کاملFETI–DP, BDDC, and Block Cholesky Methods
Two popular non-overlapping domain decomposition methods, the FETI–DP and BDDC algorithms, are reformulated using Block Cholesky factorizations, an approach which can provide a useful framework for the design of domain decomposition algorithms for solving symmetric positive definite linear system of equations. Instead of introducing Lagrange multipliers to enforce the coarse level, primal conti...
متن کاملAn Algebraic Theory for Primal and Dual Substructuring Methods by Constraints
FETI and BDD are two widely used substructuring methods for the solution of large sparse systems of linear algebraic equations arizing from discretization of elliptic boundary value problems. The two most advanced variants of these methods are the FETI-DP and the BDDC methods, whose formulation does not require any information beyond the algebraic system of equations in a substructure form. We ...
متن کاملBDDC Algorithms for Incompressible Stokes Equations
The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle-point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are iterative substructuring methods, which form a class of domain decomposition methods based on the decomposition of the domain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 36 شماره
صفحات -
تاریخ انتشار 2014